On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree
نویسندگان
چکیده
منابع مشابه
Extremal values on Zagreb indices of trees with given distance k-domination number
Let [Formula: see text] be a graph. A set [Formula: see text] is a distance k-dominating set of G if for every vertex [Formula: see text], [Formula: see text] for some vertex [Formula: see text], where k is a positive integer. The distance k-domination number [Formula: see text] of G is the minimum cardinality among all distance k-dominating sets of G. The first Zagreb index of G is defined as ...
متن کاملOn the Multiplicative Zagreb Indices of Bucket Recursive Trees
Bucket recursive trees are an interesting and natural generalization of ordinary recursive trees and have a connection to mathematical chemistry. In this paper, we give the lower and upper bounds for the moment generating function and moments of the multiplicative Zagreb indices in a randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$. Also, we consi...
متن کاملMultiplicative Zagreb Indices of Trees
Let G be a graph with vertex set V (G) and edge set E(G) . The first and second multiplicative Zagreb indices of G are Π1 = ∏ x∈V (G) deg(x) 2 and Π2 = ∏ xy∈E(G) deg(x) deg(y) , respectively, where deg(v) is the degree of the vertex v . Let Tn be the set of trees with n vertices. We determine the elements of Tn , extremal w.r.t. Π1 and Π2 . AMS Mathematics Subject Classification (2000): 05C05, ...
متن کاملOn the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملMinimizing Degree-based Topological Indices for Trees with Given Number of Pendent Vertices∗
We derive sharp lower bounds for the first and the second Zagreb indices (M1 and M2 respectively) for trees and chemical trees with the given number of pendent vertices and find optimal trees. M1 is minimized by a tree with all internal vertices having degree 4, while M2 is minimized by a tree where each “stem” vertex is incident to 3 or 4 pendent vertices and one internal vertex, while the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.04.024